Merging by Decomposition Revisited
نویسندگان
چکیده
منابع مشابه
gauss decomposition for chevalley groups, revisited
in the 1960's noboru iwahori and hideya matsumoto, eiichi abe and kazuo suzuki, and michael stein discovered that chevalley groups $g=g(phi,r)$ over a semilocal ring admit remarkable gauss decomposition $g=tuu^-u$, where $t=t(phi,r)$ is a split maximal torus, whereas $u=u(phi,r)$ and $u^-=u^-(phi,r)$ are unipotent radicals of two opposite borel subgroups $b=b(phi,r)$ and $b^-=b^-(phi,r)$ contai...
متن کاملLSP Matrix Decomposition Revisited
In this paper, we study the problem of computing an LSP-decomposition of a matrix over a field. This decomposition is an extension to arbitrary matrices of the well-known LUP-decomposition of full rowrank matrices. We present three different ways of computing an LSPdecomposition, that are both rank-sensitive and based on matrix multiplication. In each case, for an m by n input matrix of unknown...
متن کاملDecomposition and Interfaces Revisited
Abstraction and hierarchical decomposition are key principles for mastering complexity in science and engineering. In Software Engineering, the interfaces that result from the application of those principles play a crucial role, particularly when building large and complex systems. This article revisits general principles behind abstraction and decomposition and presents a collection of fundame...
متن کاملClique-decomposition revisited
The decomposition of graphs by clique-minimal separators is a common algorithmic tool, first introduced by Tarjan. Since it allows to cut a graph into smaller pieces, it can be applied to preprocess the graphs in the computation of many optimization problems. However, the best known clique-decomposition algorithms have respective O(nm)-time and O(n)-time complexity, that is prohibitive for larg...
متن کاملLinear Time Split Decomposition Revisited
Given a family F of subsets of a ground set V , its orthogonal is de ned to be the family of subsets that do not overlap any element of F . Using this tool we revisit the problem of designing a simple linear time algorithm for undirected graph split (also known as 1-join) decomposition.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1988
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/31.6.553